Improved Space for Bounded-Space, On-Line Bin-Packing
نویسندگان
چکیده
منابع مشابه
Improved Space for Bounded-Space, On-Line Bin-Packing
The author presents a sequence of linear-time, bounded-space, on-line, bin-packing algorithms that are based on the "HARMONIC" algorithms Hk introduced by Lee and Lee [J. Assoc. Comput. Mach., 32 (1985), pp. 562-572 ]. The algorithms in this paper guarantee the worst case performance of Hk, whereas they only use O(log log k) instead ofk active bins. For k >_6, the algorithms in this paper outpe...
متن کاملTwo-Bounded-Space Bin Packing Revisited
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...
متن کاملImproved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be packed into square bins of size 1×1. 90-rotation of an item is allowed. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items. The objective is to minimize the t...
متن کاملResource augmented semi-online bounded space bin packing
We study on-line bounded space bin-packing in the resource augmentation model of competitive analysis. In this model, the on-line bounded space packing algorithm has to pack a list L of items with sizes in (0, 1], into a minimum number of bins of size b, b ≥ 1. A bounded space algorithm has the property that it only has a constant number of active bins available to accept items at any point dur...
متن کاملOnline algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1993
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0406045